Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

QUOTE1(sel2(X, Y)) -> SEL12(X, Y)
ACTIVATE1(n__dbl1(X)) -> DBL1(X)
ACTIVATE1(n__indx2(X1, X2)) -> INDX2(X1, X2)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(X)
DBLS1(cons2(X, Y)) -> ACTIVATE1(X)
ACTIVATE1(n__s1(X)) -> S1(X)
ACTIVATE1(n__from1(X)) -> FROM1(X)
DBL11(s1(X)) -> ACTIVATE1(X)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(X)
ACTIVATE1(n__sel2(X1, X2)) -> SEL2(X1, X2)
DBL11(s1(X)) -> DBL11(activate1(X))
SEL12(0, cons2(X, Y)) -> ACTIVATE1(X)
QUOTE1(s1(X)) -> QUOTE1(activate1(X))
FROM1(X) -> ACTIVATE1(X)
SEL2(0, cons2(X, Y)) -> ACTIVATE1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Y)
SEL12(s1(X), cons2(Y, Z)) -> ACTIVATE1(X)
DBL1(s1(X)) -> ACTIVATE1(X)
QUOTE1(s1(X)) -> ACTIVATE1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Z)
SEL12(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> SEL2(activate1(X), activate1(Z))
ACTIVATE1(n__dbls1(X)) -> DBLS1(X)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL12(s1(X), cons2(Y, Z)) -> SEL12(activate1(X), activate1(Z))
QUOTE1(dbl1(X)) -> DBL11(X)
DBLS1(cons2(X, Y)) -> ACTIVATE1(Y)
DBL1(s1(X)) -> S1(n__s1(n__dbl1(activate1(X))))

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

QUOTE1(sel2(X, Y)) -> SEL12(X, Y)
ACTIVATE1(n__dbl1(X)) -> DBL1(X)
ACTIVATE1(n__indx2(X1, X2)) -> INDX2(X1, X2)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(X)
DBLS1(cons2(X, Y)) -> ACTIVATE1(X)
ACTIVATE1(n__s1(X)) -> S1(X)
ACTIVATE1(n__from1(X)) -> FROM1(X)
DBL11(s1(X)) -> ACTIVATE1(X)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(X)
ACTIVATE1(n__sel2(X1, X2)) -> SEL2(X1, X2)
DBL11(s1(X)) -> DBL11(activate1(X))
SEL12(0, cons2(X, Y)) -> ACTIVATE1(X)
QUOTE1(s1(X)) -> QUOTE1(activate1(X))
FROM1(X) -> ACTIVATE1(X)
SEL2(0, cons2(X, Y)) -> ACTIVATE1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Y)
SEL12(s1(X), cons2(Y, Z)) -> ACTIVATE1(X)
DBL1(s1(X)) -> ACTIVATE1(X)
QUOTE1(s1(X)) -> ACTIVATE1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Z)
SEL12(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> SEL2(activate1(X), activate1(Z))
ACTIVATE1(n__dbls1(X)) -> DBLS1(X)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL12(s1(X), cons2(Y, Z)) -> SEL12(activate1(X), activate1(Z))
QUOTE1(dbl1(X)) -> DBL11(X)
DBLS1(cons2(X, Y)) -> ACTIVATE1(Y)
DBL1(s1(X)) -> S1(n__s1(n__dbl1(activate1(X))))

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 4 SCCs with 9 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE1(n__dbl1(X)) -> DBL1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Y)
ACTIVATE1(n__indx2(X1, X2)) -> INDX2(X1, X2)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(X)
DBLS1(cons2(X, Y)) -> ACTIVATE1(X)
DBL1(s1(X)) -> ACTIVATE1(X)
ACTIVATE1(n__from1(X)) -> FROM1(X)
INDX2(cons2(X, Y), Z) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> SEL2(activate1(X), activate1(Z))
ACTIVATE1(n__dbls1(X)) -> DBLS1(X)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(X)
ACTIVATE1(n__sel2(X1, X2)) -> SEL2(X1, X2)
DBLS1(cons2(X, Y)) -> ACTIVATE1(Y)
FROM1(X) -> ACTIVATE1(X)
SEL2(0, cons2(X, Y)) -> ACTIVATE1(X)

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL12(s1(X), cons2(Y, Z)) -> SEL12(activate1(X), activate1(Z))

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DBL11(s1(X)) -> DBL11(activate1(X))

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP

Q DP problem:
The TRS P consists of the following rules:

QUOTE1(s1(X)) -> QUOTE1(activate1(X))

The TRS R consists of the following rules:

dbl1(0) -> 0
dbl1(s1(X)) -> s1(n__s1(n__dbl1(activate1(X))))
dbls1(nil) -> nil
dbls1(cons2(X, Y)) -> cons2(n__dbl1(activate1(X)), n__dbls1(activate1(Y)))
sel2(0, cons2(X, Y)) -> activate1(X)
sel2(s1(X), cons2(Y, Z)) -> sel2(activate1(X), activate1(Z))
indx2(nil, X) -> nil
indx2(cons2(X, Y), Z) -> cons2(n__sel2(activate1(X), activate1(Z)), n__indx2(activate1(Y), activate1(Z)))
from1(X) -> cons2(activate1(X), n__from1(n__s1(activate1(X))))
dbl11(0) -> 01
dbl11(s1(X)) -> s11(s11(dbl11(activate1(X))))
sel12(0, cons2(X, Y)) -> activate1(X)
sel12(s1(X), cons2(Y, Z)) -> sel12(activate1(X), activate1(Z))
quote1(0) -> 01
quote1(s1(X)) -> s11(quote1(activate1(X)))
quote1(dbl1(X)) -> dbl11(X)
quote1(sel2(X, Y)) -> sel12(X, Y)
s1(X) -> n__s1(X)
dbl1(X) -> n__dbl1(X)
dbls1(X) -> n__dbls1(X)
sel2(X1, X2) -> n__sel2(X1, X2)
indx2(X1, X2) -> n__indx2(X1, X2)
from1(X) -> n__from1(X)
activate1(n__s1(X)) -> s1(X)
activate1(n__dbl1(X)) -> dbl1(X)
activate1(n__dbls1(X)) -> dbls1(X)
activate1(n__sel2(X1, X2)) -> sel2(X1, X2)
activate1(n__indx2(X1, X2)) -> indx2(X1, X2)
activate1(n__from1(X)) -> from1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.